Data adapting motion estimation and subsampling
نویسندگان
چکیده
Motion estimation represents the main computational burden of every hybrid video encoder. Various solutions have been proposed in order to reduce the number of operations needed for this task, trying to keep good quality of the estimation and of the relative encoded video. In this paper we propose an algorithm that, exploiting the statistical properties of the motion field, searches a number of points dynamically related to the evolution of the sequence. A subsampling pattern of the Macroblock is also proposed to reduce the overall impact of the motion estimation in an MPEG encoder.
منابع مشابه
Fast and Accurate Global Motion Estimation by Combining Pixel Subsampling and Outlier Rejection
Tools based on global motion estimation (GME) have been adopted by the MPEG−4 standard. Estimating global motion parameters tends to be computationally intensive, due to the involvement of all the pixels in the calculation. If real time video coding using GME is required, then fast and accurate GME techniques are critical. Our previous work has shown that fast GME could be achieved by choosing ...
متن کاملA flexible hardware-oriented fast algorithm for motion estimation
This paper discusses the design of a fast algrithm for motion estimation with emphasis on hardware cost considerations, real-time application, network adaptation, and exibility. To achieve the best trade-o among hardware cost, computational complexity, and distortion performance, we propose a multi-stage pixelsubsampling motion estimation algorithm. The algorithm has a lower hardware cost than ...
متن کاملA new fast motion estimation algorithm using hexagonal subsampling pattern and multiple candidates search
In this paper we present a fast algorithm to reduce the computational complexity of block motion estimation. The reduction is obtained from the use of a new hexagonal subsampling pattern and the domain decimation method introduced in [14]. The multiple candidates search method is also introduced to improve the robustness of the algorithm. Computer simulation shows that the performance is very c...
متن کاملA multi-stage multi-candidate algorithm for motion estimation
Motion compensation using the optimal full search algorithm is often too computational heavy for real time implementation. Many suboptimal fast search algorithms have been proposed. In particular, Liu and Zaccarin proposed the Alternating Subsampling Search Algorithm (ASSA). The ASSA reduces the computation by subsampling the pixels instead of limiting the search locations. It was shown that AS...
متن کاملOptimizing Motion Estimation for H.264 Encoding
Around 90% of the total encoding time of raw video into H.264 is spent in block-matching, a stage of Motion Estimation. In this paper we combine two block-matching optimizations that yield significant performance improvements on Motion Estimation: 4:1 subsampling by macroblock and truncation of the two less significant bits per sample. When applied to the JM Reference Encoder, our strategy show...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000